A Weakest Precondition Model for Assembly Language Programs
نویسنده
چکیده
Reasoning about computer programs requires that program variables have well defined meaning. An imperative program may associate different values with a variable X depending on the state of its execution. This is not true of purely functional programs, which model computation using a composition of state-to-state transformations. By way of illustration, consider a program which sums the first N natural numbers.
منابع مشابه
Proof rules for purely quantum programs
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum computer in Knill’s architecture. The denotational semantics, weakest precondition semantics, and weakest liberal precondition semantics of this language fragment are introduced. To help reasoning about quantum programs in...
متن کاملOn the Translation of Procedures to Finite Machines Abstraction Allows a Clean Proof
ion Allows a Clean Proof Markus Müller-Olm and Andreas Wolf 2 ⋆ 1 Universität Dortmund, Fachbereich Informatik, LS V, 44221 Dortmund, Germany [email protected] 2 Christian-Albrechts-Universität, Institut für Informatik und Praktische Mathematik, Olshausenstraße 40, 24098 Kiel, Germany [email protected] Abstract. We prove the correctness of the translation of a prototypic While...
متن کاملAWeakest Precondition Semantics for OO Languages: An OO-Separation Logic Approach
In recent years, many researchers in the programming language and formal methods communities have been investigating weakest precondition (WP) semantics for object-oriented (OO) programs. Based on a modified version of Separation Logic, OO Separation Logic, we develop in this article a WP semantics for an OO language with most important object-oriented features including subtypes, visibility, i...
متن کاملWeakest Preconditions for High-Level Programs (Long Version)
In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preco...
متن کاملWeakest Preconditions for High-Level Programs
In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preco...
متن کامل